Deterministically Factoring Sparse Polynomials into Multilinear Factors and Sums of Univariate Polynomials
نویسنده
چکیده
We present the first efficient deterministic algorithm for factoring sparse polynomials that split into multilinear factors and sums of univariate polynomials. Our result makes partial progress towards the resolution of the classical question posed by von zur Gathen and Kaltofen in [6] to devise an efficient deterministic algorithm for factoring (general) sparse polynomials. We achieve our goal by introducing essential factorization schemes which can be thought of as a relaxation of the regular factorization notion. 1998 ACM Subject Classification F.2.1 Numerical Algorithms and Problems
منابع مشابه
Deterministically Factoring Sparse Polynomials into Multilinear Factors
We present the first efficient deterministic algorithm for factoring sparse polynomials that split into multilinear factors. Our result makes partial progress towards the resolution of the classical question posed by von zur Gathen and Kaltofen in [GK85] to devise an efficient deterministic algorithm for factoring (general) sparse polynomials. We achieve our goal by introducing essential factor...
متن کاملOn the Deterministic Complexity of Factoring Polynomials
The paper focuses on the deterministic complexity of factoring polynomials over finite fields assuming the extended Riemann hypothesis (ERH). By the works of Berlekamp (1967, 1970) and Zassenhaus (1969), the general problem reduces deterministically in polynomial time to finding a proper factor of any squarefree and completely splitting polynomial over a prime field Fp . Algorithms are designed...
متن کاملCharacter Sums and Deterministic Polynomial Root Finding in Finite Fields
Let Fq be a finite field of q elements of characteristic p. The classical algorithm of Berlekamp [1] reduces the problem of factoring polynomials of degree n over Fq to the problem of factoring squarefree polynomials of degree n over Fp that fully split in Fp, see also [8, Chapter 14]. Shoup [15, Theorem 3.1] has given a deterministic algorithm that fully factors any polynomial of degree n over...
متن کاملFactoring polynomials over Z4 and over certain Galois rings
It is known that univariate polynomials over finite local rings factor uniquely into primary pairwise coprime factors. Primary polynomials are not necessarily irreducible. Here we describe a factorisation into irreducible factors for primary polynomials over Z4 and more generally over Galois rings of characteristic p. An algorithm is also given. As an application, we factor x − 1 and x + 1 over...
متن کاملParallel Polynomial Operations on SMPs: an Overview
1 SMP-based parallel algorithms and implementations for polynomial factoring and GCD are overviewed. Topics include polynomial factoring modulo small primes, univariate and multivariate p-adic lifting, and reformulation of lift basis. Sparse polynomial GCD is also covered.
متن کامل